Poisson Approximation in a Poisson Limit Theorem Inspired by Coupon Collecting
نویسنده
چکیده
In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector’s problem when the distribution of the collector’s waiting time is asymptotically Poisson.
منابع مشابه
The Coupon-collector Problem Revisited — a Survey of Engineering Problems and Computational Methods
A standard combinatorial problem is to estimate the number (T ) of coupons, drawn at random, needed to complete a collection of all possible m types. Generalizations of this problem have found many engineering applications. The usefulness of the model is hampered by the difficulties in obtaining numerical results for moments or distributions. We show two computational paradigms that are well su...
متن کاملEntropy and the ‘compound’ Law of Small Numbers
An information-theoretic foundation for compound Poisson approximation limit theorems is presented, in analogy to the corresponding developments for the central limit theorem and for simple Poisson approximation. It is shown that the compound Poisson distributions satisfy a natural maximum entropy property within a natural class of distributions. Simple compound Poisson approximation bounds are...
متن کاملThe central limit theorem and Poisson approximation
2 Poisson approximation 6 2.1 A coupling approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Stein’s method for Poisson approximation . . . . . . . . . . . . . . . . . . . . . 8 2.2.1 Independent summands . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.2 Dependent summands: the local approach . . . . . . . . . . . . . . . . . 10 2.2.3 Size biasing and coup...
متن کاملA Poisson Limit for the Departure Process from a Queue with Many Slow Servers
We establish a limit theorem supporting a Poisson approximation for the departure process from a multi-server queue with many slow servers. This limit can support approximating a flow in a complex queueing network by an independent Poisson source. The main idea is to scale time so that previous many-server heavy-traffic limits can be applied. For time-varying arrival-rate functions, we scale (s...
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کامل